Distribution of Trace Values and Two-Weight, Self-orthogonal Codes over GF ( p , 2)
نویسندگان
چکیده
The uniform distribution of the trace map lends itself very well to the construction of binary and non-binary codes from Galois fields and Galois rings. In this paper we study the distribution of the trace map with the argument ax over the Galois field GF (p, 2). We then use this distribution to construct two-weight, self-orthogonal, trace codes.
منابع مشابه
Spectral Orbits and Peak-to-Average Power Ratio of Boolean Functions with Respect to the {I, H, N}n Transform
We enumerate the inequivalent self-dual additive codes over GF(4) of blocklength n, thereby extending the sequence A090899 in The On-Line Encyclopedia of Integer Sequences from n = 9 to n = 12. These codes have a well-known interpretation as quantum codes. They can also be represented by graphs, where a simple graph operation generates the orbits of equivalent codes. We highlight the regularity...
متن کاملWeight Enumerators of Self - Orthogonal Codes over Gf ( 3 )
The Hamming and complete weight enumerators of maximally self-orthogonal codes over GF(3) of lengths 12m 1, 12m and 12rn + are characterized. The results for length 12rn + are believed to be new, while those for length 12m-and 12m have been considerably simplified.
متن کاملAn Upper Bound for Self-Dual Codes
Gleason has described the general form that the weight distribution of a self-dual code over GF(2) and GF(3) can have. We give an explicit formula for this weight distribution when the minimum distance d between codewords is made as large as possible. It follows that for self-dual codes of length n over GF(2) with all weights divisible by 4, d ~ 4[n/24] + 4; and for self-dual codes over GF(3), ...
متن کاملSelf-dual codes over GF(7)
This paper studies self-dual and maximal self-orthogonal codes over GF(3). First, a number of Gleason-type theorems are given, describing the weight enumerators of such codes. Second, a table of all such codes of length _-<12 is constructed. Finally, the complete weight enumerators of various quadratic residue and symmetry codes of length =<60.are obtained.
متن کاملQuantum Error Correction Via Codes Over GF(4)
The problem of finding quantum-error-correcting codes is transformed into the problem of finding additive codes over the field GF (4) which are self-orthogonal with respect to a certain trace inner product. Many new codes and new bounds are presented, as well as a table of upper and lower bounds on such codes of length up to 30 qubits.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007